701. Insert into a Binary Search Tree.go

package leetcode

import"github.com/halfrost/LeetCode-Go/structures"

// TreeNode define
typeTreeNode= structures.TreeNode

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 * Val int
 * Left *TreeNode
 * Right *TreeNode
 * }
 */
funcinsert(n*TreeNode, valint) *TreeNode {
ifn==nil {
return&TreeNode{Val: val}
 }
ifn.Val<val {
n.Right=insert(n.Right, val)
 } else {
n.Left=insert(n.Left, val)
 }
returnn
}

funcinsertIntoBST(root*TreeNode, valint) *TreeNode {
returninsert(root, val)
}